On Intervals ( kn , ( k + 1 ) n ) Containing a Prime for All n > 1 Vladimir Shevelev
نویسندگان
چکیده
We study values of k for which the interval (kn, (k + 1)n) contains a prime for every n > 1. We prove that the list of such integers k includes 1, 2, 3, 5, 9, 14 and no others, at least for k ≤ 100, 000, 000. Moreover, for every known k in this list, we give a good upper bound for the smallest Nk(m), such that if n ≥ Nk(m), then the interval (kn, (k + 1)n) contains at least m primes.
منابع مشابه
On Critical Small Intervals Containing Primes
Let p be an odd prime, such that pn < p/2 < pn+1, where pn is the n-th prime. We study the following question: with what probability P there exists a prime in the interval (p, 2pn+1)? We show, that for p tends to the infinity, P ≥ 1 2 (1−ε) and conjecture that P ≤ 1 2 (1+ε).
متن کاملOn Small Intervals Containing Primes
Let p be an odd prime, such that pn < p/2 < pn+1, where pn is the n-th prime. We study the following question: with what probability does there exist a prime in the interval (p, 2pn+1)? After the strong definition of the probability with help of the Ramanujan primes ([11], [12])and the introducing pseudo-Ramanujan primes, we show, that if such probability P exists, then P ≥ 0.5. We also study a...
متن کاملBinomial Coefficient Predictors
For a prime p and nonnegative integers n, k, consider the set A (p) n,k = {x ∈ [0, 1, ..., n] : p|| ( n x ) }. Let the expansion of n + 1 in base p be n + 1 = α0p ν + α1p ν−1 + · · · + αν , where 0 ≤ αi ≤ p − 1, i = 0, . . . , ν. Then n is called a binomial coefficient predictor in base p(p-BCP), if |A (p) n,k| = αkp , k = 0, 1, . . . , ν. We give a full description of the p-BCP’s in every base p.
متن کاملOverpseudoprimes, Mersenne Numbers and Wieferich Primes
We introduce a new class of pseudoprimes-so called ”overpseudoprimes” which is a special subclass of super-Poulet pseudoprimes. Denoting via h(n) the multiplicative order of 2 modulo n,we show that odd number n is overpseudoprime if and only if the value of h(n) is invariant of all divisors d > 1 of n. In particular, we prove that all composite Mersenne numbers 2 − 1, where p is prime, and squa...
متن کاملOn Unique Additive Representations of Positive Integers and Some Close Problems
Let, for r ≥ 2, {mr(n)}n≥0 be Moser sequence such that every nonnegative integer is the unique sum of the form mr(k)+ rmr(l). In this article we give an explicit decomposition formulas of such form and a surprisingly simple recursion relations for Moser’s numbers. We also study interesting properties of the sequence {rmr(n−1)+1}n≥1 and its connection with some important problems. In particular,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013